Graph varieties in high dimension

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Varieties in High Dimension

We study the picture space X (G) of all embeddings of a finite graph G as point-andline arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural decomposition into smooth quasiprojective subvarieties called cellules, indexed by partitions of the vertex set of G, and the irreducible components of X (G) correspond t...

متن کامل

Geometry of Graph Varieties

A picture P of a graph G = (V, E) consists of a point P(v) for each vertex v ∈ V and a line P(e) for each edge e ∈ E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A graph variety is an algebraic set whose points parametrize pictures of G. We consider three kinds of graph varieties: the picture space X (G) of all pictures...

متن کامل

Special Effect Varieties in Higher Dimension

Here we introduce the concept of special effect varieties in higher dimension and we generalize to Pn, n ≥ 3, the two conjectures given in [2] for the planar case. Finally, we propose some examples on the product of projective spaces and we show how these results fit with the ones of Catalisano, Geramita and Gimigliano.

متن کامل

Some Modular Varieties in Low Dimension Iii

Some years ago in [1] the first named Author and F. Hermann studied some modular varieties related to the orthogonal group O(2, n). The most significant variety they studied was related to O(2, 6), or —equivalently— to the symplectic group of degree two defined on the quaternions. Because of a mistake, they did not get a definite result regarding the structure of the graded ring of modular form...

متن کامل

Adjacency metric dimension of the 2-absorbing ideals graph

Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry

سال: 2011

ISSN: 0138-4821,2191-0383

DOI: 10.1007/s13366-011-0064-4